منابع مشابه
Gossiping in circulant graphs Gossiping in circulant graphs
ENG) We investigate the gossiping problem, in which nodes of an intercommunication network share information initially given to each one of them according to a communication protocol by rounds. We consider two types of communication protocols: vertex-disjoint path mode, and edge-disjoint path mode. We give a general lower bound on the complexity of gossiping algorithms in terms of the isoperime...
متن کاملDomination in Circulant Graphs
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs γt-critical. In this paper, we determine the domination and the total domination number in the Circulant graphs Cn〈1, 3〉, and then study γ-criticality...
متن کاملDistance magic circulant graphs
Let G = (V,E) be a graph of order n. A distance magic labeling of G is a bijection l : V → {1, 2, . . . , n} for which there exists a positive integer k such that ∑ x∈N(v) l(x) = k for all v ∈ V , where N(v) is the open neighborhood of v. In this paper we deal with circulant graphs C(1, p). The circulant graph Cn(1, p) is the graph on the vertex set V = {x0, x1, . . . , xn−1} with edges (xi, xi...
متن کاملWell-covered circulant graphs
A graph is well-covered if every independent set can be extended to a maximum independent set. We show that it is co-NP-complete to determine whether an arbitrary graph is well-covered, even when restricted to the family of circulant graphs. Despite the intractability of characterizing the complete set of well-covered circulant graphs, we apply the theory of independence polynomials to show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2014
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2012.749886